Selective Minterms Based Tabular Method for BDD Manipulations
نویسندگان
چکیده
The goal of this work is to describe a new algorithm for finding the optimal variable order, number of nodes for any order and other ROBDD parameters, based on a tabular method. The tabular method makes use of a pre-built backend database table that stores the ROBDD size for selected combinations of min-terms. The user uses the backend table and the proposed algorithm to find the necessary ROBDD parameters, such as best variable order, number of nodes etc. Experimental results on benchmarks are given for this technique. Keywords—Tabular Method, Binary Decision Diagram, BDD Manipulation, Boolean Function.
منابع مشابه
Techniques for dual forms of Reed-Muller expansion conversion
Dual Forms of Reed–Muller (DFRM) are implemented in OR/XNOR forms, which are based on the features of coincidence operation. Map folding and transformation techniques are proposed for the conversion between Boolean and DFRM expansions. However, map techniques can only be used for up to 6 variables. To overcome the limitation, serial tabular technique (STT) and parallel tabular technique (PTT) a...
متن کاملHardware Acceleration for BDD manipulations
In this paper, in order to accelerate BDD based algorithms, we propose implementing BDD operations by hardware. We have designed a RTL model of the proposed hardware, and expressed it by C language so that we can count the number of clocks needed for each BDD operation. We have examined its performance improvement with respect to the original software library by using several benchmark circuits.
متن کاملBDD Package Based on Boolean NOR Operation
Binary Decision Diagrams (BDDs) are useful data structures for symbolic Boolean manipulations. BDDs are used in many tasks in VLSI/CAD, such as equivalence checking, property checking, logic synthesis, and false paths. In this paper we describe a new approach for the realization of a BDD package. To perform manipulations of Boolean functions, the proposed approach does not depend on the recursi...
متن کاملTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کاملDesign of Experiments in BDD Variable Ordering
Design of Experiments in BDD Variable Ordering: Lessons Learned Justin E. Harlow III1 Franc Brglez2 1Dept. of Electrical & Computer Engineering, Duke University, Durham, NC 27708 2CBL (Collaborative Benchmarking Lab), Dept. of Comp. Science, Box 7550, NC State U., Raleigh, NC 27695 http://www.cbl.ncsu.edu/ Abstract { Applying the Design of Experiments methodology to the evaluation of BDD variab...
متن کامل